Cayley graph

Results: 49



#Item
31replacements Expansions of Semigroups

replacements Expansions of Semigroups

Add to Reading List

Source URL: www.math.ucsb.edu

Language: English - Date: 2003-06-27 03:02:08
32AN INTRODUCTION TO GARSIDE STRUCTURES JON MCCAMMOND 1 Abstract. Geometric combinatorialists often study partially ordered sets in

AN INTRODUCTION TO GARSIDE STRUCTURES JON MCCAMMOND 1 Abstract. Geometric combinatorialists often study partially ordered sets in

Add to Reading List

Source URL: www.math.ucsb.edu

Language: English - Date: 2005-02-15 17:59:00
33Combinatorial descriptions of multi-vertex 2-complexes

Combinatorial descriptions of multi-vertex 2-complexes

Add to Reading List

Source URL: www.math.ucsb.edu

Language: English - Date: 2011-03-09 11:09:38
34Unravelling the (miniature) Rubik’s Cube through its Cayley Graph Daniel Bump1 and Daniel Auerbach2

Unravelling the (miniature) Rubik’s Cube through its Cayley Graph Daniel Bump1 and Daniel Auerbach2

Add to Reading List

Source URL: sporadic.stanford.edu

Language: English - Date: 2011-06-09 18:38:47
35AUSTRALASIAN JOURNAL OF COMBINATORICS Volume[removed]), Pages 63–80

AUSTRALASIAN JOURNAL OF COMBINATORICS Volume[removed]), Pages 63–80

Add to Reading List

Source URL: ajc.maths.uq.edu.au

Language: English - Date: 2011-10-03 01:53:37
36Notes on the Matrix-Tree theorem and Cayley’s tree enumerator 1. Cayley’s tree enumerator Recall that the degree of a vertex in a tree (or in any graph) is the number of edges emanating from it. We will determine the generating function enumerating labelled trees on the vertex

Notes on the Matrix-Tree theorem and Cayley’s tree enumerator 1. Cayley’s tree enumerator Recall that the degree of a vertex in a tree (or in any graph) is the number of edges emanating from it. We will determine the generating function enumerating labelled trees on the vertex

Add to Reading List

Source URL: math.berkeley.edu

Language: English - Date: 2010-04-01 18:10:45
37On Howson’s Theorem Wilfried Imrich Department of Mathematics and Applied Geometry,

On Howson’s Theorem Wilfried Imrich Department of Mathematics and Applied Geometry,

Add to Reading List

Source URL: s369550579.online.de

Language: English - Date: 2009-03-05 17:00:14
38ON THE GIRTH OF GROUPS SAUL SCHLEIMER Abstract. DISCLAIMER: Everything that follows is of a preliminary nature. We give a new invariant for finitely generated groups,

ON THE GIRTH OF GROUPS SAUL SCHLEIMER Abstract. DISCLAIMER: Everything that follows is of a preliminary nature. We give a new invariant for finitely generated groups,

Add to Reading List

Source URL: www.math.rutgers.edu

Language: English - Date: 2003-06-08 15:28:32
39SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM* BY GERHARD RINGEL AND J. W. T. YOUNGS UNIVERSITY OF CALIFORNIA (SANTA CRUZ)

SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM* BY GERHARD RINGEL AND J. W. T. YOUNGS UNIVERSITY OF CALIFORNIA (SANTA CRUZ)

Add to Reading List

Source URL: www.pnas.org

Language: English - Date: 2005-04-22 15:17:54
40GROUPS, GRAPHS, AND THE HANNA NEUMANN CONJECTURE IGOR MINEYEV

GROUPS, GRAPHS, AND THE HANNA NEUMANN CONJECTURE IGOR MINEYEV

Add to Reading List

Source URL: www.math.uiuc.edu

Language: English - Date: 2012-02-28 12:48:56